Fuzzy cellular automata with complete number-conserving rule as traffic-flow models with bottleneck

Eventually Number-Conserving Cellular Automata

We present a preliminary study of a new class of two-input cellular automaton rules called eventually number-conserving rules characterized by the property of evolving after a finite number of time steps to states whose number of active sites remains constant. Viewed as models of systems of interacting particles, these rules obey a kind of Darwinian principle by either annihilating unnecessary ...

Enumeration of Number-Conserving Cellular Automata Rules with Two Inputs

Cellular automata (CA) rules possessing additive invariants have been studied since early 90’s. The simplest form of an additive invariant is the sum of all site values over a finite lattice with periodic boundary conditions. Rules with such an invariant are known as number-conserving rules, and they exhibit many interesting properties. For example, they can be viewed as systems of interacting ...

Number-conserving cellular automata I: decidability

We prove that de6nitions of number-conserving cellular automata found in literature are equivalent. A necessary and su9cient condition for cellular automata to be number-conserving is proved. Using this condition, we give a quasi-linear time algorithm to decide number-conservation. c © 2002 Elsevier Science B.V. All rights reserved.

A cellular automata framework for studying expandable traffic flow models

The introduction of methods from statistical physics for traffic flow modelling, such as cellular automata models, enabled the faster than real time simulation of large traffic networks. A key issue faced by such efforts is the expandability of the network model. This paper discusses the development of a cellular automata framework for micro-simulation of vehicle traffic flow in road networks a...

State-Conserving Cellular Automata